An optimal perfect matching with respect to the Clar problem in 2-connected plane bipartite graphs
نویسنده
چکیده
We provide an optimality criteria for a perfect matching with respect to the Clar problem in 2-connected plane bipartite graphs.
منابع مشابه
The complexity of the Clar number problem and an FPT algorithm
The Clar number of a (hydro)carbon molecule, introduced by Clar [E. Clar, The aromatic sextet, (1972).], is the maximum number of mutually disjoint resonant hexagons in the molecule. Calculating the Clar number can be formulated as an optimization problem on 2-connected planar graphs. Namely, it is the maximum number of mutually disjoint even faces a perfect matching can simultaneously alternat...
متن کاملOn the inverse maximum perfect matching problem under the bottleneck-type Hamming distance
Given an undirected network G(V,A,c) and a perfect matching M of G, the inverse maximum perfect matching problem consists of modifying minimally the elements of c so that M becomes a maximum perfect matching with respect to the modified vector. In this article, we consider the inverse problem when the modifications are measured by the weighted bottleneck-type Hamming distance. We propose an alg...
متن کاملMatching Integral Graphs of Small Order
In this paper, we study matching integral graphs of small order. A graph is called matching integral if the zeros of its matching polynomial are all integers. Matching integral graphs were first studied by Akbari, Khalashi, etc. They characterized all traceable graphs which are matching integral. They studied matching integral regular graphs. Furthermore, it has been shown that there is no matc...
متن کاملForcing faces in plane bipartite graphs
Let denote the class of connected plane bipartite graphs with no pendant edges. A finite face s of a graphG ∈ is said to be a forcing face ofG if the subgraph ofG obtained by deleting all vertices of s together with their incident edges has exactly one perfect matching. This is a natural generalization of the concept of forcing hexagons in a hexagonal system introduced in Che and Chen [Forcing ...
متن کاملA ug 2 00 9 Extremal fullerene graphs with the maximum Clar number ∗
A fullerene graph is a cubic 3-connected plane graph with (exactly 12) pentagonal faces and hexagonal faces. Let Fn be a fullerene graph with n vertices. A set H of mutually disjoint hexagons of Fn is a sextet pattern if Fn has a perfect matching which alternates on and off each hexagon in H. The maximum cardinality of sextet patterns of Fn is the Clar number of Fn. It was shown that the Clar n...
متن کامل